Practical Minimum Cut Algorithms
نویسندگان
چکیده
منابع مشابه
Practical Minimum Cut Algorithms
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequenti...
متن کاملPractical Performance of Eecient Minimum Cut Algorithms
In the late eighties and early nineties, three major exciting new developments (and some rami cations) in the computation of minimum capacity cuts occurred and these developments motivated us to evaluate the old and new methods experimentally. We provide a brief overview of the most important algorithms for the minimum capacity cut problem and compare these methods both on problem instances fro...
متن کاملAlmost-Tight Distributed Minimum Cut Algorithms
We study the problem of computing the minimum cut in a weighted distributed messagepassing networks (the CONGEST model). Let λ be the minimum cut, n be the number of nodes (processors) in the network, and D be the network diameter. Our algorithm can compute λ exactly in O(( √ n log∗ n+D)λ log n) time. To the best of our knowledge, this is the first paper that explicitly studies computing the ex...
متن کاملPractical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p is the number of processors. For this case, we show that simple algorithms with dataindependent communication patterns are efficient, both in theory and in practice. The algorithms are evaluated theoretically using Va...
متن کاملNew algorithms for the Minimum Coloring Cut Problem
The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E′ of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in E′ is minimum. In this work, we present two approaches based on Variable Neighborhood Search to solve this problem. Our algorithms are able to find ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2018
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3274662